A dependently-typed construction of semi-simplicial types
نویسندگان
چکیده
منابع مشابه
A dependently-typed construction of semi-simplicial types
equipped with face operators di : Xn → Xn−1 for n ≥ 1 and 0 ≤ i ≤ n satisfying di ◦ d n+1 j = d n j ◦ d n+1 i+1 for n ≥ i ≥ j ≥ 0. See e.g. (Friedman, 2012) for more on the ideas underlying semi-simplicial and simplicial sets. Each element x ∈ Xn+1 can be canonically associated to the set of its faces {di (x)|0 ≤ i ≤ n}, the set of the faces of its faces {dn−1 i (dj (x))|0 ≤ j ≤ i ≤ n − 1}, etc...
متن کاملSelf Types for Dependently Typed Lambda Encodings
We revisit lambda encodings of data, proposing new solutions to several old problems, in particular dependent elimination with lambda encodings. We start with a type-assignment form of the Calculus of Constructions, restricted recursive definitions and Miquel’s implicit product. We add a type construct ιx.T , called a self type, which allows T to refer to the subject of typing. We show how the ...
متن کاملA Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access control policies, expressed indirectly via classification of ambients in groups by means of ‘group types.’ The paper presents a theory of dependent types for the Ambient calculus which allows ...
متن کاملDependently-Typed Formalisation of Typed Term Graphs
The Coconut project [AK09a, AK09b] uses “code graphs” [KAC06], a variant of term graphs in the spirit of “jungles” [HP91, CR93], as intermediate presentation for the generation of highly optimised assembly code. This is currently implemented in Haskell, and we use the Haskell type system in an embedded domain-specific language (EDSL) for creating such code graphs via what appears to be standard...
متن کاملDependently Typed Meta-programming
Dependent types and multi stage programming have both been used, separately, as implementation techniques for programming languages. Each technique has its own advantages — with dependent types, we can verify aspects of interpreters and compilers such as type safety and stack invariants. Multi stage programming, on the other hand, can give the implementor access to underlying compiler technolog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2014
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129514000528